Modelling failures times with dependent renewal type models via exchangeability
نویسندگان
چکیده
منابع مشابه
Loss Models with Dependent Service Times
Effective approximations are developed for the blocking probability in a general stationary loss model with dependence among successive service times as well as among successive interarrival times by exploiting heavy-traffic limits for the steady-state number of busy servers in the associated infinite-server model with the same arrival and service processes. In addition, a new heavy-traffic app...
متن کاملCyclic-type Polling Models with Preparation Times
We consider a system consisting of a server serving in sequence a fixed number of stations. At each station there is an infinite queue of customers that have to undergo a preparation phase before being served. This model is connected to layered queuing networks, to an extension of polling systems, and surprisingly to random graphs. We are interested in the waiting time of the server. The waitin...
متن کاملExchangeability and regression models
Sir David Cox’s statistical career and his lifelong interest in the theory and application of stochastic processes began with problems in the wool industry. The problem of drafting a strand of wool yarn to near uniform width is not an auspicious starting point, but an impressive array of temporal and spectral methods from stationary time series were brought to bear on the problem in Cox (1949)....
متن کاملDelayed renewal process with uncertain interarrival times
Delayed renewal process and delayed renewal reward process are introduced in the framework of uncertainty theory and their uncertainty distributions are provided. Furthermore, delayed renewal theorem on the limit value of the expected renewal rate of the process and delayed renewal reward theorem on the limit value of the long-run expected reward per unit time are presented. At last, some examp...
متن کاملModeling with dependent failures
My broad research interest is in dependable systems, in particular developing fault-tolerant distributed algorithms and applying them to practical problems. Developing dependable systems is an important goal as we increasingly rely upon large-scale wide-area distributed systems to support a wide range of online services. As systems scale in size and extent, efficiently coping with failures is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics
سال: 2019
ISSN: 0233-1888,1029-4910
DOI: 10.1080/02331888.2019.1618858